An Automata-Theoretic Approach to Regular XPath
نویسندگان
چکیده
In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: linear-time query evaluation and exponential-time reasoning. To establish these results, we devise a unifying automata-theoretic framework based on two-way weak alternating tree automata. Specifically, we consider automata that have infinite runs on finite trees. This enables us to leverage and simplify existing automata-theoretic machinery and develop algorithms both for query evaluation and for reasoning over queries. With respect to the latter problem, we consider RXPath as a constraint language, and study constraint satisfiability, and query satisfiability and containment under constraints in the setting of RXPath.
منابع مشابه
Automata for Positive Core XPath Queries on Compressed Documents
Given any dag t representing a fully or partially compressed XML document, we present a method for evaluating any positive unary query expressed in terms of Core XPath axes, on t, without unfolding t into a tree. To each Core XPath query of a certain basic type, we associate a word automaton; these automata run on the graph of dependency between the non-terminals of the straightline regular tre...
متن کاملAutomata for Analyzing and Querying Compressed Documents
In a first part of this work, tree/dag automata are defined as extensions of (unranked) tree automata which can run indifferently on trees or dags; they can thus serve as tools for analyzing or querying any semi-structured document, whether or not given in a compressed format. In a second part of the work, we present a method for evaluating positive unary queries, expressed in terms of Core XPa...
متن کاملRegular XPath: Constraints, Query Containment and View-Based Answering for XML Documents
In this paper we consider a powerful mechanism, called Regular XPath, for expressing queries and constraints over XML data, including DTDs and existential path constraints and their negation. Regular XPath extends XPath with binary relations over XML nodes specified by means two-way regular path queries. Our first contribution deals with checking satisfiability of Regular XPath constraints. Whi...
متن کاملCost-Based Optimization of Regular Path Queries on Large Graphs
The significance of regular path queries (RPQs) on graphlike data structures has grown steadily over the past decade. Prominent application areas are XML/XPath, RDF/SPARQL, analysis of social networks, and queries on biomedical networks. However, current implementations of RPQ are restricted either in the type of the graph (e.g., only trees), the type of regular expressions (e.g., only single s...
متن کاملAn Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects
A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law. We prove that a regular language obeys the zero-one law if and only if its syntactic monoid has a zero element, by means of Eilenberg’s variety theoretic approach. Our proof gives an effective automata characterisation of the zero-one law ...
متن کامل